A Minimum Output Burstiness Traffic Scheduling Algorithm
نویسنده
چکیده
In this paper, we present a traffic scheduling algorithm, called the Delay-Bound Monotonic with Average Rate Reservation (DM/ARR), which generates minimum output burstiness streams. We assume that connection i is policed by the leaky bucket algorithm with parameters (σi, ρi) where σi is the bucket size (or burstiness) and ρi is the leaky rate. Compared with the totally isolated scheme where connection i is allocated a bandwidth ri = max{i di , ρi} (di is the delay bound re-
منابع مشابه
High Speed Networks SCHEDULING ALGORITHMS FOR BOUNDED DELAY SERVICE IN VIRTUAL NETWORKS
With their widespread deployment, the need to provide QoS in virtual networks is being realized. We show that traditional scheduling algorithms like WFQ are incapable of providing bounded delay service in a virtual network. The problem arises because traffic of a number of sessions sharing a virtual link in a virtual network is aggregated and tunneled through the physical network, which cannot ...
متن کاملStatistical Analysis of Link Scheduling on Long Paths
We study how the choice of packet scheduling algorithms influences end-to-end performance on long network paths. Taking a network calculus approach, we consider both deterministic and statistical performance metrics. A key enabling contribution for our analysis is a significantly sharpened method for computing a statistical bound for the service given to a flow by the network as a whole. For a ...
متن کاملDeterministic Delay Bounds for VBR Video in Packet-Switching Networks: Fundamental Limits and Practi - Networking, IEEE/ACM Transactions on
Compressed digital video is one of the most important traffic types in future integrated services networks. However, a network service that supports delay-sensitive video imposes many problems since compressed video sources are variable bit rate (VBR) with a high degree of burstiness. In this paper, we consider a network service that can provide deterministic guarantees on the minimum throughpu...
متن کاملAn Approach to Scheduling Bursty Traffic
© 2014 Mahmoud Daneshvar Farzanegan et al. 69 http://dx.doi.org/10.4218/etrij.14.0112.0524 The scheduling scheme in packet switching networks is one of the most critical features that can affect the performance of the network. Hence, many scheduling algorithms have been suggested and some indices, such as fairness and latency, have been proposed for the comparison of their performances. While t...
متن کاملFair and Smooth Scheduling for Virtual Output Queuing Switches Achieving 100% Throughput
Cell scheduling has received extensive attention. Most recent studies, however, focus on achieving a 100% switch throughput under the uniform arrivals. As the demand for quality of service increases, two important goals are to provide predictive cell latency and to reduce the output burstiness. This paper presents a new scheduling algorithm, Worst-case Iterative Longest Port First (WiLPF), whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999